package com.ibeetl.eval;

import java.util.ArrayList;
import java.util.List;

/**
 * 计算结果，包含了整个树的运行结果.如果不关心整颗数的计算过程，直接取出根节点的结果
 * @author xiandafu
 *
 */
public class TreeNode {
	Object result;
	TreeNode parentNode;
	String nodeName;
	Object nodeRefInfo;
	List<TreeNode> children = new ArrayList<TreeNode>();
	public Object getResult() {
		return result;
	}
	public void setResult(Object result) {
		this.result = result;
	}
	public TreeNode getParentNode() {
		return parentNode;
	}
	public void setParentNode(TreeNode parentNode) {
		this.parentNode = parentNode;
	}
	public String getNodeName() {
		return nodeName;
	}
	public void setNodeName(String nodeName) {
		this.nodeName = nodeName;
	}
	public Object getNodeRefInfo() {
		return nodeRefInfo;
	}
	public void setNodeRefInfo(Object nodeRefInfo) {
		this.nodeRefInfo = nodeRefInfo;
	}
	public List<TreeNode> getChildren() {
		return children;
	}
	public void setChildren(List<TreeNode> children) {
		this.children = children;
	}
	@Override
	public String toString() {
		return "TreeNode [result=" + result + ", nodeName=" + nodeName + "]";
	}
	
	
	
}
